Edge Growth in Graph Cubes
نویسندگان
چکیده
We show that for every connected graph G of diameter ≥ 3, the graph G3 has average degree ≥ 7 4δ(G). We also provide an example showing that this bound is best possible. This resolves a question of Hegarty [3].
منابع مشابه
Edge-critical isometric subgraphs of hypercubes
Isometric subgraphs of hypercubes are known as partial cubes. Edge-critical partial cubes are introduced as the partial cubes G for which G e is not a partial cube for any edge e of G. An expansion theorem is proved by means of which one can generate many edge-critical partial cubes. Edge-critical partial cubes are characterized among the Cartesian product graphs. We also show that the 3-cube a...
متن کاملSuper-connectivity and super-edge-connectivity for some interconnection networks
Let G 1⁄4 ðV ;EÞ be a k-regular graph with connectivity j and edge connectivity k. G is maximum connected if j 1⁄4 k, and G is maximum edge connected if k 1⁄4 k. Moreover, G is super-connected if it is a complete graph, or it is maximum connected and every minimum vertex cut is fxjðv; xÞ 2 Eg for some vertex v 2 V ; and G is super-edge-connected if it is maximum edge connected and every minimum...
متن کاملPartial cubes as subdivision graphs and as generalized Petersen graphs
Isometric subgraphs of hypercubes are known as partial cubes. The subdivision graph of a graph G is obtained from G by subdividing every edge of G. It is proved that for a connected graph G its subdivision graph is a partial cube if and only if every block of G is either a cycle or a complete graph. Regular partial cubes are also considered. In particular it is shown that among the generalized ...
متن کاملEfficient Embeddings into Hypercube-like Topologies
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bise...
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1009.0343 شماره
صفحات -
تاریخ انتشار 2010